Computational Complexity and Tort Deterrence

نویسندگان

چکیده

Standard formulations of the economic model tort deterrence constitute injurer as unboundedly rational bad man. Unbounded rationality implies that can always compute solution to his caretaking problem. This in turn optimal liability rules provide robust deterrence, for they induce take socially care. In this paper I examine computational complexity injurer’s show problem is computationally tractable when precaution set unidimensional or convex but it intractable multidimensional and discrete. One implication standard assumptions care, though seemingly innocuous, are pivotal ensuring law deterrence. It therefore important recognize situations with discrete where may not be possible.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deterrence, litigation costs, and the statute of limitations for tort suits

The conventional justification for a statute of limitations on tort suits (or any other legal claim) is that evidence deteriorates over time, thereby increasing the likelihood of legal error. The optimal statute balances this cost of a longer statute length against the dilution in deterrence that results from a shorter length. In this paper I develop a formal model to show that a finite statute...

متن کامل

Computational Complexity and Knowledge Complexity

We study the computational complexity of languages which have interactive proofs of logarithmic knowledge complexity. We show that all such languages can be recognized in BPPNP . Prior to this work, for languages with greater-than-zero knowledge complexity only trivial computational complexity bounds were known. In the course of our proof, we relate statistical knowledge complexity to perfect k...

متن کامل

On the Computational Complexity of the Domination Game

The domination game is played on an arbitrary graph $G$ by two players, Dominator and Staller. It is known that verifying whether the game domination number of a graph is bounded by a given integer $k$ is PSPACE-complete. On the other hand, it is showed in this paper that the problem can be solved for a graph $G$ in $mathcal O(Delta(G)cdot |V(G)|^k)$ time. In the special case when $k=3$ and the...

متن کامل

Computational Complexity and Cycling

Computational Complexity and Cycling

متن کامل

Descriptive and Computational Complexity

Computational complexity began with the natural physical notions of time and space Given a property S an important issue is the computational complexity of checking whether or not an input satis es S For a long time the notion of complexity referred to the time or space used in the compu tation A mathematician might ask What is the complexity of expressing the property S It should not be surpri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of Legal Studies

سال: 2022

ISSN: ['0047-2530', '1537-5366']

DOI: https://doi.org/10.1086/718806